ALGORITHMS FOR OPTIMAL ALLOCATION PROBLEMS HAVING QUADRATIC OBJECTIVE FUNCTION
نویسندگان
چکیده
منابع مشابه
Algorithms for Optimal Allocation Problems Ha Ving Quadratic Objective Function
In this paper, an optimal allocation problem (APQ) with a quadratic objective function, a total resource constraint and an upper and lower bound constraint is considered. The APQ is a very basic and simple model but it can serve as a sub problem in the solution of the generalized allocation problem. Applying the Lagrange relaxation method, an explicit expression of the dual function associated ...
متن کاملApproximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms
In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced. In this approach, first a discretized form of the time-control space is considered and then, a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...
متن کاملMulti-objective Evolutionary Algorithms for Resource Allocation Problems
A resource allocation problem (RAP) is encountered in a variety of areas in operations research and management science. It is generally treated as a combinatorial optimization problem, where a limited amount of resources are to be allocated to certain number of competitive events in order to achieve the most effective allotment of the resources. An RAP usually contains a huge number of integer ...
متن کاملNear-Optimal Online Algorithms for Dynamic Resource Allocation Problems
In this paper, we study a general online linear programming problem whose formulation encompasses many practical dynamic resource allocation problems, including internet advertising display applications, revenue management, various routing, packing, and auction problems. We propose a model, which under mild assumptions, allows us to design near-optimal learning-based online algorithms that do n...
متن کاملapproximate pareto optimal solutions of multi-objective optimal control problems by evolutionary algorithms
in this paper an approach based on evolutionary algorithms to find pareto optimal pair of state and control for multi-objective optimal control problems (moocp)'s is introduced. in this approach, first a discretized form of the time-control space is considered and then, a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1980
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.23.64